ProbLog2: Probabilistic Logic Programming
نویسندگان
چکیده
We present ProbLog2, the state of the art implementation of the probabilistic programming language ProbLog. The ProbLog language allows the user to intuitively build programs that do not only encode complex interactions between a large sets of heterogenous components but also the inherent uncertainties that are present in real-life situations. The system provides efficient algorithms for querying such models as well as for learning their parameters from data. It is available as an online tool on the web and for download. The offline version offers both command line access to inference and learning and a Python library for building statistical relational learning applications from the system’s components.
منابع مشابه
ProbLog2: From Probabilistic Programming to Statistical Relational Learning
ProbLog is a probabilistic programming language based on Prolog. The new ProbLog system called ProbLog2 can solve a range of inference and learning tasks typical for the Probabilistic Graphical Models (PGM) and Statistical Relational Learning (SRL) communities. The main mechanism behind ProbLog2 is a conversion of the given program to a weighted Boolean formula. We argue that this conversion ap...
متن کاملLifted Variable Elimination for Probabilistic Logic Programming
Lifted inference has been proposed for various probabilistic logical frameworks in order to compute the probability of queries in a time that depends on the size of the domains of the random variables rather than the number of instances. Even if various authors have underlined its importance for probabilistic logic programming (PLP), lifted inference has been applied up to now only to relationa...
متن کاملProbabilistic Logic Programming under Maximum Entropy Justus-liebig- Universit at Gieeen Ifig Research Report Probabilistic Logic Programming under Maximum Entropy
In this paper, we focus on the combination of probabilistic logic programming with the principle of maximum entropy. We start by deening probabilistic queries to probabilistic logic programs and their answer substitutions under maximum entropy. We then present an eecient linear programming characterization for the problem of deciding whether a probabilistic logic program is satissable. Finally,...
متن کاملProbabilistic and Truth-functional Many-valued Logic Programming Justus-liebig- Universit at Gieeen Ifig Research Report Probabilistic and Truth-functional Many-valued Logic Programming
We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-v...
متن کاملA Design Methodology for Reliable MRF-Based Logic Gates
Probabilistic-based methods have been used for designing noise tolerant circuits recently. In these methods, however, there is not any reliability mechanism that is essential for nanometer digital VLSI circuits. In this paper, we propose a novel method for designing reliable probabilistic-based logic gates. The advantage of the proposed method in comparison with previous probabilistic-based met...
متن کامل